Strategies for Minimizing the Average Cost of Paging on the Air Interface
نویسندگان
چکیده
Location Management of mobile users in a cellular network covers tracking and paging (searching) functionality. In this paper a sequential search strategy is proposed which reduces the signaling on the air interface and also considers the user’s privacy using implicit addresses. After introducing some related work on paging and reducing the costs of paging, the basic idea of the search strategy is described. The used paging methods are crucial for the effectiveness of this strategy. For that, three different paging methods are proposed using fixed and variable segment sizes. The methods are evaluated according to their costs in terms of delay, bandwidth and paging steps. For that the model is described we used for our simulations. Metrics are defined to evaluate the strategies before presenting our results using an event-driven simulation.
منابع مشابه
Minimizing the Average Cost of Paging on the Air Interface – An Approach Considering Privacy
Location Management of mobile users in a cellular network is considered from a performance and privacy point of view. Location management covers tracking functionality and paging (searching) functionality. After a risk analysis of location management w.r.t. privacy, we focus on the paging strategy. A sequential search strategy is proposed which reduces the signaling on the air interface and als...
متن کاملPaging Strategies for Highly Mobile Users
In this work, we consider the problem of minimizing average paging cost and polling delay in a wireless system. It is assumed that users to be paged move according to a general motion process during the paging events. We nd and evaluate the optimal sequential paging strategies for given maximum delay tolerance and compare our results to the classical paging strategy as well as the optimal strat...
متن کاملPaging Strategies for Highly Mobile Users - Vehicular Technology Conference, 1996. 'Mobile Technology for the Human Race'., IEEE 46th
locations polled to that point is n sn = kj (1) In this work, we consider the problem of minimizing average paging cost and polling delay in a wireless system. It is assumed that users to be paged move according to a genera1 motion process during the paging events. We find and evaluate the optimal sequential paging strategies for given maximum delay tolerance and compare our results to the clas...
متن کاملHighly Mobile Users and Paging: Optimal Polling Strategies
We consider the problem of minimizing average paging cost subject to delay constraints in a wireless system. Previous work assumed the unit to be found did not move during the paging process whereas here the unit may change location during polling events. We show that the conditionally most probable locations, given that the unit has not yet been found, should be searched first. We find the opt...
متن کاملHighly Mobile Users and Paging : optimal
| We consider the problem of minimizing average paging cost subject to delay constraints in a wireless system. Previous work assumed the unit to be found did not move during the paging process whereas here the unit may change location during polling events. We show that the conditionally most probable locations given that the unit has not yet been found should be searched rst. We nd the optimal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999